|
In the mathematical discipline of graph theory, the dual graph of a plane graph is a graph that has a vertex for each face of . The dual graph has an edge whenever two faces of are separated from each other by an edge. Thus, each edge of has a corresponding dual edge, the edge that connects the two faces on either side of . Graph duality is a topological generalization of the geometric concepts of dual polyhedra and dual tessellations, and is in turn generalized algebraically by the concept of a dual matroid. Variations of planar graph duality include a version of duality for directed graphs, and duality for graphs embedded onto non-planar two-dimensional surfaces. However, the notion described in this page is different from the edge-to-vertex dual (line graph) of a graph and should not be confused with it. The term "dual" is used because this property is symmetric, meaning that if is a dual of , then is a dual of (if is connected). When discussing the dual of a graph , the graph itself may be referred to as the "primal graph". Many other graph properties and structures may be translated into other natural properties and structures of the dual. For instance, cycles are dual to cuts, spanning trees are dual to the complements of spanning trees, and simple graphs (without parallel edges or self-loops) are dual to 3-edge-connected graphs. Polyhedral graphs, and some other planar graphs, have unique dual graphs. However, for planar graphs more generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph. Testing whether one planar graph is dual to another is NP-complete. ==Examples== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「dual graph」の詳細全文を読む スポンサード リンク
|